Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors
نویسندگان
چکیده
Proof. Input Mapping: The graph G is taken as it is. We choose γmin = 1, nmin = k, smin = 0, robj = 1, rdim = 0, a = c = 0, and b > log x x−1 (2 − 2) with x = max{2, |V |}. Output Mapping: The cardinality of the result Result obtained by OV ERALL corresponds to the number of maximum cliques in the graph. (1): The set of twofold clusters only contains all cliques (γmin = 1) of at least size k (nmin = k). As for usual cliques, the attribute values do not matter (smin = 0). (2): Only subsets of clusters induce redundancy, i.e.
منابع مشابه
Mining Cohesive Patterns from Graphs with Feature Vectors
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to graph data, where nodes represent entities, edges relationships between entities, and feature vectors associated with the nodes represent properties of entities. Often features and edges contain complementary informatio...
متن کاملDB-CSC: A Density-Based Approach for Subspace Clustering in Graphs with Feature Vectors
Data sources representing attribute information in combination with network information are widely available in today’s applications. To realize the full potential for knowledge extraction, mining techniques like clustering should consider both information types simultaneously. Recent clustering approaches combine subspace clustering with dense subgraph mining to identify groups of objects that...
متن کاملCombining near-optimal feature selection with gSpan
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and anomaly detection in program flows. Among the various approaches proposed in the literature, graph classification based on frequent subgraphs is a popular branch: Graphs are represented as (usually binary) vectors, with c...
متن کاملNear-optimal Supervised Feature Selection among Frequent Subgraphs
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and anomaly detection in program flows. Among the various approaches proposed in the literature, graph classification based on frequent subgraphs is a popular branch: Graphs are represented as (usually binary) vectors, with c...
متن کاملNew techniques for clustering complex objects
The tremendous amount of data produced nowadays in various application domains such as molecular biology or geography can only be fully exploited by efficient and effective data mining tools. One of the primary data mining tasks is clustering, which is the task of partitioning points of a data set into distinct groups (clusters) such that two points from one cluster are similar to each other wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013